Convergence of the weak dual greedy algorithm in Lp-spaces
نویسندگان
چکیده
منابع مشابه
Convergence of the weak dual greedy algorithm in Lp-spaces
We prove that the weak dual greedy algorithm converges in any subspace of a quotient of Lp when 1opoN: r 2003 Elsevier Inc. All rights reserved. A subset D of a (real) Banach space X is called a dictionary if (i) D is normalized i.e. if gAD implies jjgjj 1⁄4 1: (ii) D is symmetric i.e. D 1⁄4 D: (iii) D is fundamental i.e. 1⁄2D 1⁄4 X : Given xAX we are interested in algorithms which generate a s...
متن کاملConvergence of the dual greedy algorithm in Banach spaces
We show convergence of the weak dual greedy algorithm in wide class of Banach spaces, extending our previous result where it was shown to converge in subspaces of quotients of Lp (for 1 < p < ∞). In particular, we show it converges in the Schatten ideals Sp when 1 < p < ∞ and in any Banach lattice which is p-convex and q-concave with constants one, where 1 < p < q < ∞. We also discuss convergen...
متن کاملOn the weak convergence of kernel density estimators in Lp spaces
Since its introduction, the pointwise asymptotic properties of the kernel estimator f̂n of a probability density function f on Rd, as well as the asymptotic behaviour of its integrated errors, have been studied in great detail. Its weak convergence in functional spaces, however, is a more di cult problem. In this paper, we show that if fn(x) = E(f̂n(x)) and (rn) is any nonrandom sequence of posit...
متن کاملWeak Thresholding Greedy Algorithms in Banach Spaces
We consider weak thresholding greedy algorithms with respect to Markushevich bases in general Banach spaces. We find sufficient conditions for the equivalence of boundedness and convergence of the approximants. We also show that if there is a weak thresholding algorithm for the system which gives the best n-term approximation up to a multiplicative constant, then the system is already “greedy”....
متن کاملWeak Convergence of Mann Iterative Algorithm for two Nonexpansive mappings
The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2003
ISSN: 0021-9045
DOI: 10.1016/s0021-9045(03)00133-3